Parity Subgraphs with Few Common Edges and Nowhere-Zero 5-Flow
نویسندگان
چکیده
A parity subgraph of a graph is a spanning subgraph such that the degrees of all vertices have the same parity in both the subgraph and the original graph. Let G be a cyclically 6-edge-connected cubic graph. Steffen (Intersecting 1-factors and nowhere-zero 5-flows 1306.5645, 2013) proved that G has a nowhere-zero 5-flow if G has two perfect matchings with at most two intersections. In this paper, we show that G has a nowhere-zero 5-flow if G has two parity subgraphs with at most two common edges, which generalizes Steffen’s result.
منابع مشابه
Nowhere-zero k-flows of supgraphs
Let G be a 2-edge-connected graph with o vertices of odd degree. It is well-known that one should (and can) add o 2 edges to G in order to obtain a graph which admits a nowhere-zero 2-flow. We prove that one can add to G a set of ≤ ⌊ o 4⌋, ⌈ 1 2⌊ o 5⌋⌉, and ⌈ 1 2⌊ o 7⌋⌉ edges such that the resulting graph admits a nowhere-zero 3-flow, 4-flow, and 5-flow,
متن کاملNowhere-zero k-flows of Supergraphs
Let G be a 2-edge-connected graph with o vertices of odd degree. It is well-known that one should (and can) add o 2 edges to G in order to obtain a graph which admits a nowhere-zero 2-flow. We prove that one can add to G a set of ≤ b o 4c, d2b o 5ce, and d2b o 7ce edges such that the resulting graph admits a nowhere-zero 3-flow, 4-flow, and 5-flow, respectively.
متن کاملNOTE - On circular flows of graphs
Here, we give a simple proof of this theorem without using linear programming. Proof. Since G is 6-edge-connected, by Tutte [5, Theorem 1] or NashWilliams [4, Theorem 1], let T1,T2,T3 be three edge disjoint spanning trees of G. Let Pi be a parity subgraph of Ti (for i=1,2 only). Now fixing some orientation of G. Since P1∪P2 and G\E(P1) are even graphs, let f1 be a nowhere-zero 2-flow with suppo...
متن کاملCubic Graphs without a Petersen Minor Have Nowhere–zero 5–flows
We show that every bridgeless cubic graph without a Petersen minor has a nowhere-zero 5-flow. This approximates the known 4-flow conjecture of Tutte. A graph has a nowhere-zero k-flow if its edges can be oriented and assigned nonzero elements of the group Zk so that the sum of the incoming values equals the sum of the outcoming ones for every vertex of the graph. An equivalent definition we get...
متن کاملNowhere-zero Unoriented Flows in Hamiltonian Graphs
An unoriented flow in a graph, is an assignment of real numbers to the edges, such that the sum of the values of all edges incident with each vertex is zero. This is equivalent to a flow in a bidirected graph all of whose edges are extraverted. A nowhere-zero unoriented k-flow is an unoriented flow with values from the set {±1, . . . ,±(k − 1)}. It has been conjectured that if a graph has a now...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Graphs and Combinatorics
دوره 31 شماره
صفحات -
تاریخ انتشار 2015